Parallel Decomposition of Generic Morphological Structuring Elements
نویسندگان
چکیده
The decomposition of a binary morphological structuring element is a well-known problem in pattern recognition that has often been addressed in the literature. Generally, only deterministic solutions have been considered, each relying on different assumptions. A different solution, with no such constraints, has been proposed by Anelli, Broggi and Destri: it is based on a stochastic evolutionary technique which is obviously computationally demanding. This work presents its parallel implementation aimed to the improvement of both the qualitative and quantitative performance of this approach.
منابع مشابه
Morphological Structuring Elements
For image processing systems that have a limited size of region of support, say 3 x 3, direct implementation of morphological operations by a structuring element larger than the prefixed size is impossible. The decomposition of morphological operations by a large structuring element into a sequence of recursive operations, each using a smaller structuring element, enables the implementation of ...
متن کامل3×3 Decomposition of Circular Structuring Elements
This paper presents some results to decompose circular structuring elements into 3 x 3 elements. Decomposition allows to improve the expended time in computing morphological operations. Generally, the shape of the structuring element determines the image transformation. Morphological operations with disks can be used as slhape and size descriptors. The optimal discrete approximation of a disk c...
متن کاملCamps , Kanungo and Haralick : Grayscale Sturcturing Element Decomposition
| EEcient implementation of morphological operations requires the decomposition of structuring elements into the dilation of smaller structuring elements. Zhuang and Haralick presented a search algorithm to nd optimal decompositions of structuring elements in binary morphology. In this paper we use the concepts of Top of a set and Umbra of a surface to extend this algorithm to nd an optimal dec...
متن کاملGray-Scale Structuring Element Decomposition - Image Processing, IEEE Transactions on
AbstructEfficient implementation of morphological operations requires the decomposition of structuring elements into the dilation of smaller structuring elements. Zhuang and Haralick presented a search algorithm to find optimal decompositions of structuring elements in binary morphology. In this paper, we use the concepts of Top of a set and Umbra of a surface to extend this algorithm to find a...
متن کاملExperiments on the Decomposition of Arbitrarily Shaped Binary Morphological Structuring Elements
The decomposition of binary structuring elements is a key problem in morphological image processing. So far only the decomposition of convex structuring elements and of speciic subsets of non-convex ones have been proposed in the literature. This work presents the results of a new approach, based on a Genetic Algorithm, in which no constraints are imposed on the shape of the initial structuring...
متن کامل